Coloring the distance graphs
نویسندگان
چکیده
Let $$n\geqslant 1$$ be a number. $${\Gamma }_n$$ the graph on $$\mathbb {R}^n$$ connecting points of rational Euclidean distance. It is consistent with choiceless set theory $$\textrm{ZF}\,{+}\,\textrm{DC}$$ that has countable chromatic number, yet number $$\Gamma _{n+1}$$ uncountable.
منابع مشابه
Distance Graphs and T-Coloring
We discuss relationships among T-colorings of graphs and chromatic numbers, fractional chromatic numbers, and circular chromatic numbers of distance graphs. We first prove that for any finite integral set T that contains 0, the asymptotic T-coloring ratio R(T ) is equal to the fractional chromatic number of the distance graph G(Z, D), where D=T&[0]. This fact is then used to study the distance ...
متن کاملColoring of integer distance graphs
An integer distance graph is a graph G(D) with the set of integers as vertex set and with an edge joining two vertices u and v if and only if ju ? vj 2 D where D is a subset of the positive integers. We determine the chromatic number (D) of G(D) for some nite distance sets D such as sets of consecutive integers and special sets of cardinality 4.
متن کامل2-distance Coloring of Sparse Graphs
A 2-distance coloring of a graph is a coloring of the vertices such that two vertices at distance at most 2 receive distinct colors. We prove that every graph with maximum degree Δ at least 4 and maximum average degree less that 73 admits a 2-distance (Δ + 1)-coloring. This result is tight. This improves previous known results of Dolama and Sopena.
متن کاملCircular Coloring for Graphs with Distance Constraints
Let G = (V,E) be a simple un-weighted graph, and let → d= (d1, d2, · · ·, dm) be a sequence of positive reals. For a positive real r, let Sr denote the circle on R 2 centered at the origin with circumference r. A circular r−coloring for G with distance constraint → d is a mapping f : V (G) → Sr such that |f(u) − f(v)|r ≥ di, whenever the distance between u and v in G is i (where |x− y|r is the ...
متن کاملThe packing coloring of distance graphs D(k, t)
The packing chromatic number χρ(G) of a graph G is the smallest integer p such that vertices of G can be partitioned into disjoint classes X1, . . . , Xp where vertices in Xi have pairwise distance between them greater than i. For k < t we study the packing chromatic number of infinite distance graphs D(k, t), i.e. graphs with the set Z of integers as vertex set and in which two distinct vertic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European journal of mathematics
سال: 2023
ISSN: ['2199-675X', '2199-6768']
DOI: https://doi.org/10.1007/s40879-023-00665-6